Preliminary Bulbous Bow Design Tool Applying K Nearest Neighbours Classification and Regression Model

نویسندگان

چکیده

Designing bulbous bows for ships remains a challenging task. Their impact on different design attributes as well their change in performance when operating off intended condition renders this multidimensional problem. This paper explores the application of machine learning techniques to sample in-service vessel data develop preliminary tool. The ships' was analysed together with bow generate models using supervised approach. K Nearest Neighbours Classifier and Regression were used basis Together, these can be predict whether install recommended dimensionless coefficients new vessels. Generating tool required introduction that discretise bow's longitudinal section. gives designer ability determine should fitted and, if so, obtain an initial estimate being designed, based key input parameters relate ship its operation. is demonstrated provide details through case studies.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Regression Conformal Prediction with Nearest Neighbours

In this paper we apply Conformal Prediction (CP) to the k -Nearest Neighbours Regression (k -NNR) algorithm and propose ways of extending the typical nonconformity measure used for regression so far. Unlike traditional regression methods which produce point predictions, Conformal Predictors output predictive regions that satisfy a given confidence level. The regions produced by any Conformal Pr...

متن کامل

K nearest neighbours with mutual information for simultaneous classification and missing data imputation

Missing data is a common drawback in many real-life pattern classification scenarios. One of the most popular solutions is missing data imputation by the K nearest neighbours ðKNNÞ algorithm. In this article, we propose a novel KNN imputation procedure using a feature-weighted distance metric based on mutual information (MI). This method provides a missing data estimation aimed at solving the c...

متن کامل

Instance and Feature Weighted k-Nearest-Neighbours Algorithm

We present a novel method that aims at providing a more stable selection of feature subsets when variations in the training process occur. This is accomplished by using an instance-weighting process –assigning different importances to instances– as a preprocessing step to a feature weighting method that is independent of the learner, and then making good use of both sets of computed weigths in ...

متن کامل

Efficient Estimation of the number of neighbours in Probabilistic K Nearest Neighbour Classification

Probabilistic k-nearest neighbour (PKNN) classification has been introduced to improve the performance of original k-nearest neighbour (KNN) classification algorithm by explicitly modelling uncertainty in the classification of each feature vector. However, an issue common to both KNN and PKNN is to select the optimal number of neighbours, k. The contribution of this paper is to incorporate the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Maritime Engineering

سال: 2021

ISSN: ['1740-0716', '1479-8751', '1740-2700']

DOI: https://doi.org/10.5750/ijme.v163ia3.806